منابع مشابه
On the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کاملThe Complexities of the Coefficients of the Tutte Polynomial
The complexity of calculating the coefficients of the Tutte polynomial of a graph is considered. The calculation of some coefficients is shown to be # P-complete, whereas some other coefficients can be computed in polynomial time. However, even for a hard coefficient, it can be decided in polynomial time whether it is less than a fixed constant.
متن کاملon the tutte polynomial of benzenoid chains
the tutte polynomial of a graph g, t(g, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. in this paper a simple formula for computing tutte polynomial of a benzenoid chain is presented.
متن کاملThe Tutte polynomial
This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new interpretations relating to random graphs, lattice point enumeration, and chip firing games. I then examine complexity issues and concentrate in particular, on the existence of randomized approximation schemes. © 1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 210–...
متن کاملFourientations and the Tutte polynomial
for α, γ ∈ {0, 1, 2} and β , δ ∈ {0, 1}. We introduce an intersection lattice of 64 cut–cycle fourientation classes enumerated by generalized Tutte polynomial evaluations of this form. We prove these enumerations using a single deletion–contraction argument and classify axiomatically the set of fourientation classes to which our deletion–contraction argument applies. This work unifies and exten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00150-1